Bottleneck Partial-Matching Voronoi Diagrams and Applications
نویسندگان
چکیده
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equallysized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic variant, which generalize to higher dimensions. We use the diagram to find an optimal bottleneck matching under translations, to compute a connecting path of minimum bottleneck cost between two positions of B, and to determine the maximum bottleneck cost in a convex polygon.
منابع مشابه
Bottleneck Partial-Matching Voronoi Diagrams
Given two point sets in the plane, we study the minimization of the (lexiocographic) bottleneck distance between the smaller set and an equally-sized subset of the larger set under translations. We relate this problem to two Voronoi-type diagrams, which are of interest for related problems. Their complexity is shown to be polynomial in the sizes of the sets and algorithms for their construction...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملBregman Voronoi Diagrams: Properties, Algorithms and Applications
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. In this paper, we investigate a framework...
متن کاملSpatial Density Voronoi Diagram and Construction
To fill a theory gap of Voronoi diagrams that there have been no reports of extended diagrams in spatial density so far. A new concept of spatial density Voronoi diagram was proposed. An important property was presented and proven. And a construction algorithm was presented. Spatial density can be used to indicate factors related to density such as conveyance and the traffic conditions. Some pr...
متن کاملAn Interactive Tour of Voronoi Diagrams on the GPU
Voronoi diagrams are fundamental geometric structures that have been both deeply and widely investigated since their inception in disguise by René Descartes for analyzing the gravitational influence of stars, in the 17 century. Voronoi diagrams find countless applications in science and engineering beyond graphics as attested by the long representative, and yet non-exhaustive, list of applicati...
متن کامل